全文获取类型
收费全文 | 204篇 |
免费 | 80篇 |
国内免费 | 8篇 |
出版年
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 5篇 |
2018年 | 3篇 |
2017年 | 16篇 |
2016年 | 26篇 |
2015年 | 15篇 |
2014年 | 26篇 |
2013年 | 42篇 |
2012年 | 13篇 |
2011年 | 11篇 |
2010年 | 16篇 |
2009年 | 12篇 |
2008年 | 9篇 |
2007年 | 11篇 |
2006年 | 13篇 |
2005年 | 19篇 |
2004年 | 12篇 |
2003年 | 5篇 |
2002年 | 5篇 |
2001年 | 10篇 |
2000年 | 4篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1994年 | 2篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有292条查询结果,搜索用时 265 毫秒
41.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
42.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
43.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
44.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
45.
46.
47.
基于 ∆TOA 和方位角测量辅以间歇高度信息的双基地定位跟踪技术 总被引:2,自引:0,他引:2
本文讨论了双基地雷达系统中一种以收站△TOA和方位角测量为基础并辅以发射站传送的间歇高度信息的运动目标三维定位跟踪算法,详细分析了该技术的定位原理。在电子对抗条件下,发射站数据往往难以连续传送到接收站加以融合,因此有必要对间断传送的数据加以利用的方法进行研究。本文通过典型目标航迹的计算机仿真对该算法的性能做了评估。由于这种融合方法在双基地研究领域尚属初探,因此有待于在今后的研究中加以完善。 相似文献
48.
49.
50.
在建立的加工设备机电系统精确动力学模型及对模型参数实时辨识的基础上[1],建立柔性加工设备机电系统的状态监测模型,包括BAYES故障检测、突发故障检测及故障分析与定位等;同时利用Kul-back信息距离和多层递阶AR模型实现系统的状态与故障预警。在加工设备上的实验表明模型可行有效,它能排除柔性多变工况、时变性及随机干扰对监测与预警功能的影响,提高其鲁棒性和自适应能力。 相似文献